Efficient Modular Design of TSC Checkers for M-out-of-2M Codes

On Tsc Checkers for M-out-of-n Codes

Paschalis et al. in [12] have given a structured method to design TSC m-out-of-2m code checkers suitable for VLSI implementation. In this correspondence we give sufficient conditions so that the method given in [12] can be used to design checkers for classes of m-outof-n codes with n * 2m.

Design of Compact and High speed, Totally Self Checking CMOS Checkers for m-out-of-n Codes

This paper presents a novel method for designing TSC m-out-ofn code checkers taking into account a realistic fault model including stuck-at, transistor stuck-on, transistor stuck-open, resistive bridging faults and breaks. The proposed design method is the first method in the open literature that takes into account a realistic fault model and can be applied for all practical values of m and n. ...

Modular design of totally self-checking checkers for 1-out-of-n codes

Novel Single and Double Output TSC Berger Code Checkers

This paper presents a novel method for designing type-I and type-II single and double output TSC Berger code checkers taking into account a realistic fault model including stuck-at, transistor stuck-open, transistor stuckon, resistive bridging faults and breaks. A benefit of the proposed type-I single and double output checkers is that all faults are testable by a very small set of code words t...

New efficient totally self-checking Berger code checkers

This paper presents a new method for designing totally self-checking (TSC) Berger code checkers for any number k of information bits, even for k"2r~1, taking into account realistic faults as stuck-at, transistor stuck-open, transistor stuck-on and resistive bridging faults. Doubleas well as single-output TSC checkers are given. The proposed single-output TSC Berger code checkers are the "rst in...